北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2011, Vol. 34 ›› Issue (5): 71-75.doi: 10.13190/jbupt.201105.71.dongch

• 研究报告 • 上一篇    下一篇

优化分组长度的IEEE 802.11网络性能

董超1,陈贵海2,于卫波1,米志超1   

  1. 1.解放军理工大学 通信工程学院,南京 210007; 2. 南京大学 软件新技术国家重点实验室,南京 210093
  • 收稿日期:2010-11-18 修回日期:2011-04-14 出版日期:2011-10-28 发布日期:2011-08-26
  • 通讯作者: 董超 E-mail:dch999@gmail.com
  • 基金资助:

    国家重点基础研究发展计划项目(2009CB3020402); 国家自然科学基金项目(61103224); 江苏省自然科学基金项目(BK2011118); 解放军理工大学预先研究基金资助项目(20110105)

A Study Dealed with IEEE 802.11 Networks  Using Packet Size Optimization

Chao DONG   

  • Received:2010-11-18 Revised:2011-04-14 Online:2011-10-28 Published:2011-08-26
  • Contact: Chao DONG E-mail:dch999@gmail.com

摘要:

节点移动等特征使得IEEE 802.11网络中存在大量的短时通信. 为了实现短时相遇业务流的公平通信和较高的网络吞吐量,理论分析了非理想信道中保证最高链路吞吐量的分组长度;借助仿真模拟了保证短时相遇业务流公平通信的分组长度,并给出了经验值;得到了可以在短时公平通信的前提下实现较高网络吞吐量的最优分组长度. 仿真结果表明,利用分析得到的分组长度进行通信,相遇业务流可以在给定时间内实现公平通信,同时保持较高的网络吞吐量.

关键词: IEEE 802.11, 短时公平性, 吞吐量, 分组长度, 优化

Abstract:

In wireless networks including IEEE 802.11 networks, it is known that the node mobility leads to extensive shortduration communication. To achieve the timebound fairness between the meeting flows and keep relatively high network throughput, the optimal packet size to obtain the optimal link throughput in the errorprone channel is analyzed. The channel bit error rate and flow contending time is given. The timebound fairness problem of two meeting flows is addressed using the packet size adjustment. Finally, the optimal packet size is concluded. Simulations show that during the short meeting term, the channel contention fairness of the meeting flows can be ensured and the network throughput is kept relatively high when using the proposed optimal packet size.

Key words: IEEE 802.11, timebound fairness, throughput, packet size, optimization